431![Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ´ Colin de Verdi`ere Eric ´ Ecole Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ´ Colin de Verdi`ere Eric ´ Ecole](https://www.pdfsearch.io/img/e4889d4dcb3386ebbb704d37c52511bc.jpg) | Add to Reading ListSource URL: www.di.ens.frLanguage: English - Date: 2011-03-29 05:33:44
|
---|
432![Ann Math Artif Intell:281–305 DOIs10472A framework for multi-robot node coverage in sensor networks Andrea Gasparri · Bhaskar Krishnamachari · Ann Math Artif Intell:281–305 DOIs10472A framework for multi-robot node coverage in sensor networks Andrea Gasparri · Bhaskar Krishnamachari ·](https://www.pdfsearch.io/img/de470f979b1ece5e09cefe1457db9128.jpg) | Add to Reading ListSource URL: robotics.usc.eduLanguage: English - Date: 2014-06-13 19:42:54
|
---|
433![On Compact Representations of AllPairsShortestPath Distance Matrices Igor Nitto and Rossano Venturini On Compact Representations of AllPairsShortestPath Distance Matrices Igor Nitto and Rossano Venturini](https://www.pdfsearch.io/img/83a6fe76216145d558e9900aed51c985.jpg) | Add to Reading ListSource URL: www.cs.ucr.eduLanguage: English - Date: 2008-06-19 13:08:02
|
---|
434![CS109B Notes for LectureDepth-First Search A method of exploring a directed graph and CS109B Notes for LectureDepth-First Search A method of exploring a directed graph and](https://www.pdfsearch.io/img/fb2f05869d35fc66d02e54f222e50584.jpg) | Add to Reading ListSource URL: infolab.stanford.eduLanguage: English - Date: 2008-09-19 00:58:41
|
---|
435![On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs Minghui Jiang Utah State University CPM On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs Minghui Jiang Utah State University CPM](https://www.pdfsearch.io/img/4dd022275213d3f627291c79f27205b2.jpg) | Add to Reading ListSource URL: www.cs.ucr.eduLanguage: English - Date: 2010-08-20 17:45:36
|
---|
436![Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu](https://www.pdfsearch.io/img/4eb73b8282c6f0b7bc72b0d98ae555e6.jpg) | Add to Reading ListSource URL: www.umiacs.umd.eduLanguage: English - Date: 2010-08-02 09:34:23
|
---|
437![Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi](https://www.pdfsearch.io/img/00d89574402351cf426614f68a3f9147.jpg) | Add to Reading ListSource URL: lovelace.thi.informatik.uni-frankfurt.deLanguage: English - Date: 2012-06-27 11:58:26
|
---|
438![Generic and Automatic Address Configuration for Data ∗ Center Networks Kai Chen⋆† , Chuanxiong Guo† , Haitao Wu† , Jing Yuan‡⋆ , Zhenqian Feng♯† , Yan Chen⋆ , Songwu Lu§ , Wenfei Wu♮† Generic and Automatic Address Configuration for Data ∗ Center Networks Kai Chen⋆† , Chuanxiong Guo† , Haitao Wu† , Jing Yuan‡⋆ , Zhenqian Feng♯† , Yan Chen⋆ , Songwu Lu§ , Wenfei Wu♮†](https://www.pdfsearch.io/img/b6c248cf44db5a55bb2ef875e23a83bf.jpg) | Add to Reading ListSource URL: www.cse.ust.hkLanguage: English - Date: 2010-06-19 17:44:26
|
---|
439![The Stanford GraphBase: A Platform for Combinatorial Computing Donald E. Knuth, Stanford University A highly portable collection of programs and data is now available to researchers who study combinatorial algorithms and The Stanford GraphBase: A Platform for Combinatorial Computing Donald E. Knuth, Stanford University A highly portable collection of programs and data is now available to researchers who study combinatorial algorithms and](https://www.pdfsearch.io/img/68e69ea2ea0170347403432040993b15.jpg) | Add to Reading ListSource URL: www.literateprogramming.comLanguage: English - Date: 2007-10-09 02:25:27
|
---|
440![Partial Pathfinding Using Map Abstraction and Refinement Nathan Sturtevant and Michael Buro Department of Computing Science, University of Alberta Edmonton, Alberta, Canada T6G 2E8 {nathanst,mburo}@cs.ualberta.ca Partial Pathfinding Using Map Abstraction and Refinement Nathan Sturtevant and Michael Buro Department of Computing Science, University of Alberta Edmonton, Alberta, Canada T6G 2E8 {nathanst,mburo}@cs.ualberta.ca](https://www.pdfsearch.io/img/c7fccfcc358a82cdbcb9ccc040ccd991.jpg) | Add to Reading ListSource URL: www.societyofrobots.comLanguage: English - Date: 2010-01-10 09:34:29
|
---|